Discrete Algorithms for Mobile and Wireless Networks Lecture 22 : Thursday , 10 th April 2007
نویسنده
چکیده
The Minimum Dominating Set (MDS) problem is to find a minimum such S for a given network graph. It is the fundamental math problem underlying routing: construct “cluster heads” in the network graph so you can rapidly, hierarchically, send messages from one cluster to another, and the cluster heads will oversee routing within and through the individual cluster. Of course, the members of S are the routers or cluster heads. So MDS asks, “Can we find the smallest set of efficient routers?”
منابع مشابه
Discrete Algorithms for Mobile and Wireless Networks Lecture 2 : Thursday , 18 th January 2007 Instructor :
متن کامل
Discrete Algorithms for Mobile and Wireless Networks Lecture 10 : Part A : Thursday Feb 15 th , 07 Instructor : Soma
Recent research envisions wireless sensor networks as collections of tiny, autonomous devices with computation, sensing and communication capabilities. Various implementations of such so-called sensor motes exist and networks of different scales have been deployed. There has been active research both on theory and algorithms and on software architectures. Although many classical distributed res...
متن کاملDiscrete Algorithms for Mobile and Wireless Networks Lecture 12 : Thursday , 22 nd February 2007 Instructor : Soma Chaudhuri Scribe : Aaron Sterling
This class period focused on a theoretical application of collision-detectors to solve the consensus problem; and the implementation of replicated state machines, to produce fault-tolerant wireless networks. We reviewed two papers: “Consensus and Collision Detectors in Wireless Ad Hoc Networks” by G. Chockler, M. Demirbas and S. Gilbert; and “Replicated State Machines” by G. Chockler and S. Gil...
متن کاملDiscrete Algorithms for Mobile and Wireless Networks Lecture 23 : Thursday , 12 th April 2007 Instructor : Soma Chaudhuri Scribe : Puviyarasan Pandian
With large-scale wireless networks, the associated challenges of self-configuration of the network , self-healing in the case of any failure and self-maintenance assume significant importance. Without even one these features, the sensor network formed cannot be used any further. A possible solution to this problem is to use clustering of the nodes in the network. A geographical-radius based clu...
متن کاملDiscrete Algorithms for Mobile and Wireless Networks Lecture 19 Part B : Thursday , 29 th March 2007
This paper deals with the problem of maintaining a distributed directory server, that enables us to keep track of mobile users in a distributed network in the presence of concurrent requests. The paper uses the graph-theoretic concept of regional matching for implementing efficient tracking mechanisms. The tracking mechanism has to support two operations: a move operation, causing a user to mov...
متن کامل